Checking Monotone Boolean Duality with Limited Nondeterminism

We present an algorithm that checks the duality of a pair of monotone Boolean expressions in disjunctive normal form in polynomial time plus O(log n/ log logn) nondeterministic guesses, where n is the size of the input, thus improving a previous result of Kavvadias and Stavropoulos [IPL, 85(1):1–6, 2003] and Eiter et al. [STOC 2003] which placed the problem in co-NP[log n], the subclass of co-NP where only the first O(log n) steps are nondeterministic. 1 University of Patras, Department of Mathematics, GR-265 04 Patras, Greece. E-mail: [email protected] 2 University of Patras, Computer Engineering & Informatics Department, GR-265 04 Patras, Greece. E-mail: [email protected] ∗ Corresponding author. TECHNICAL REPORT No. 2003/07/02 1 RESEARCH ACADEMIC COMPUTER TECHNOLOGY INSTITUTE 2003